Quasi-linear Dialectica Extraction
نویسنده
چکیده
Gödel’s functional interpretation [Göd58] can be used to extract programs from non-constructive proofs. Though correct by construction, the obtained terms can be computationally inefficient. One reason for slow execution is the re-evaluation of equal subterms due to the use of substitution during the extraction process. In the present paper we define a variant of the interpretation, which avoids subterm repetition and achieves an almost linear bound on the size of extracted programs.
منابع مشابه
Light Functional Interpretation - an optimization of Gödel ’ s technique towards the extraction of ( more ) efficient programs from ( classical ) proofs - Technical Appendix
We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...
متن کاملNatural Number Objects in Dialectica Categories
This note sets down some facts about natural number objects in the Dialectica category Dial2(Sets). Natural number objects allow us to model Gödel’s System T in an intrinsically logical fashion. Gödel’s Dialectica Interpretation is a powerful tool originally used to prove the consistency of arithmetic. It was surprising (but pleasing) to discover, in the late eighties, that studying the Dialect...
متن کاملDialectica models of additive-free linear logic
We define a transformation of models of additivefree propositional linear logic, closely related to de Paiva’s dialectica categories, but with a modified exponential based on Oliva’s dialectica interpretation of higher-order linear logic. As a result of this modification we obtain an elegant factorisation of dialectica models as linear-nonlinear adjunctions. From the point of view of game seman...
متن کاملLight Functional Interpretation - an optimization of Gödel’s technique towards the extraction of (more) efficient programs from (classical) proofs
We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...
متن کاملApplying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
We use Gödel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive 'minimal bad sequence' proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly present, along with an explicit program for finding an embedded pair in sequences of words.
متن کامل